Rational Realizations of the Minimum Rank of a Sign Pattern Matrix
نویسندگان
چکیده
A sign pattern matrix is a matrix whose entries are from the set {+,−, 0}. The minimum rank of a sign pattern matrix A is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of A. It is conjectured that the minimum rank of every sign pattern matrix can be realized by a rational matrix. The equivalence of this conjecture to several seemingly unrelated statements are established. For some special cases, such as when A is entrywise nonzero, or the minimum rank of A is at most 2, or the minimum rank of A is at least n−1 (where A is m×n), the conjecture is shown to hold. Connections between this conjecture and the existence of positive rational solutions of certain systems of homogeneous quadratic polynomial equations with each coefficient equal to either −1 or 1 are investigated. AMS classification: 15A36; 15A03; 15A48; 15A24; 11D09; 11P21
منابع مشابه
Minimum ranks of sign patterns via sign vectors and duality
A sign pattern matrix is a matrix whose entries are from the set {+,−, 0}. The minimum rank of a sign pattern matrix A is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of A. It is shown in this paper that for any m×n sign pattern A with minimum rank n− 2, rational realization of the minimum rank is possible. This is done using a new ap...
متن کاملThe Minimum Rank Problem: a counterexample
We provide a counterexample to a recent conjecture that the minimum rank of every sign pattern matrix can be realized by a rational matrix. We use one of the equivalences of the conjecture and some results from projective geometry. As a consequence of the counterexample we show that there is a graph for which the minimum rank over the reals is strictly smaller than the minimum rank over the rat...
متن کاملRational realization of maximum eigenvalue multiplicity of symmetric tree sign patterns
Abstract. A sign pattern is a matrix whose entries are elements of {+,−, 0}; it describes the set of real matrices whose entries have the signs in the pattern. A graph (that allows loops but not multiple edges) describes the set of symmetric matrices having a zero-nonzero pattern of entries determined by the absence or presence of edges in the graph. DeAlba et al. [3] gave algorithms for the co...
متن کامل1 4 M ay 2 01 5 The complexity of computing the minimum rank of a sign pattern matrix ̊
We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In fact, our hardness result shows that it is already hard to determine if the minimum rank of a sign pattern matrix is ď 3. We complement this by giving a pol...
متن کاملThe complexity of computing the minimum rank of a sign pattern matrix
We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In fact, our hardness result shows that it is already hard to determine if the minimum rank of a sign pattern matrix is ď 3. We complement this by giving a pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005